An Annotated Bibliography for Post - solution

نویسنده

  • Harvey J. Greenberg
چکیده

This is the ongoing BibT E X bibliography. Unlike the original publication 63], additions do not have annotations. They are located at the beginning of the bib le, and the most recent additions were References 1] J. Acevedo and E.N. Pistikopoulos. A hybrid parametric/stochastic programming approach for mixed-integer linear problems under uncertainty. The problem is to nd a minimum cost spanning tree in the presence of certain constraints: (i) some cities must be outer nodes, and (ii) some pairs of cities must have a direct connection. (The constraints in (ii) could require the communication network to have a cycle, so there is a tacit assumption that this is not the case.) The cost between a pair of cities (i; j) is the product of the communication requirement, r ij , and the length of the path connecting them. Sensitivity analysis is performed on one communication requirement.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Women's issues: an annotated bibliography.

A solution to get the problem off, have you found it? Really? What kind of solution do you resolve the problem? From what sources? Well, there are so many questions that we utter every day. No matter how you will get the solution, it will mean better. You can take the reference from some books. And the womens issues an annotated bibliography is one book that we really recommend you to read, to ...

متن کامل

An Annotated Bibliography for Post - solutionAnalysis in Mixed Integer Programming andCombinatorial

This annotated bibliography focuses on what has been published since the 1977 Geoorion-Nauss survey, and it is in BibT E X format, so it can be searched on the World Wide Web. In addition to postoptimal sensitivity analysis, this survey includes debugging a run, such as when the integer program is unbounded, anomalous or infeasible.

متن کامل

Grasp: an Annotated Bibliography

A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for combinatorial optimization. It is a multi-start or iterative process, in which each GRASP iteration consists of two phases, a construction phase, in which a feasible solution is produced, and a local search phase, in which a local optimum in the neighborhood of the constructed solution is sought. Since 1989, numerous p...

متن کامل

Solution methods for the p-median problem: An annotated bibliography

The p-median problem is a graph theory problem that was originally designed for, and has been extensively applied to, facility location. In this bibliography, we summarize the literature on solution methods for the uncapacitated and capacitated p-median problem on a graph or network.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999